Reductions for non-clausal theorem proving
نویسندگان
چکیده
منابع مشابه
Reductions for non-clausal theorem proving
This paper presents the TAS methodology 1 as a new framework for generating non-clausal Automated Theorem Provers. We present a complete description of the ATP for Classical Propositional Logic, named TAS-D, but the ideas, which make use of implicants and implicates can be extended in a natural manner to first-order logic, and non-classical logics. The method is based on the application of a nu...
متن کاملRewrite Methods for Clausal and Non-Clausal Theorem Proving
Effective theorem provers are essential for automatic verification and generation of programs. The conventional resolution strategies, albeit complete, are inefficient. On the other hand, special purpose methods, such as term rewriting systems for solving word problems, are relatively efficient but applicable to only limited classes of problems. In this paper, a simple canonical set of rewrite ...
متن کاملnanoCoP: Natural Non-clausal Theorem Proving
Most efficient fully automated theorem provers implement proof search calculi that require the input formula to be in a clausal form, i.e. disjunctive or conjunctive normal form. The translation into clausal form introduces a significant overhead to the proof search and modifies the structure of the original formula. Translating a proof in clausal form back into a more readable non-clausal proo...
متن کاملNon-clausal Resolution Theorem Proving for Fuzzy Predicate Logic
The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without the need of skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constru...
متن کاملNon-clausal Resolution Theorem Proving for Description Logic
The article presents refutational resolution theorem proving system for Description Logic (DL) based on general (non-clausal) resolution rule. There is also presented unification algorithm handling existentiality without the need of skolemization in first-order logic. Its idea follows from general resolution with existentiality for first-order logic. When the prover is constructed it provides t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00044-x